Approximation algorithms - PDFSEARCH.IO - Document Search Engine

Approximation algorithms
Results: 332

#	Item
81	Tutorial: The Lasserre Hierarchy in Approximation algorithms Thomas Rothvoß Department of Mathematics, MIT MAPSP 2013 Add to Reading List Source URL: math.mit.edu Language: English - Date: 2014-01-08 17:30:08
82	Approximation algorithms for mixed, windy, and capacitated arc routing problems René van Bevern1 , Christian Komusiewicz2 , and Manuel Sorge2 1 2 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2015-08-10 10:23:26 Dynamic programming Routing algorithms Eulerian path Shortest path problem FloydWarshall algorithm NP-complete problems Planar separator theorem Dominating set
83	Structural properties underlying high-quality Randomized Numerical Linear Algebra algorithms Michael W. Mahoney ∗ Add to Reading List Source URL: www.stat.berkeley.edu Language: English - Date: 2016-03-03 02:50:08 Numerical linear algebra Matrix Principal component analysis Orthogonal matrix Gaussian elimination Singular value decomposition Low-rank approximation MoorePenrose pseudoinverse QR decomposition QR algorithm Matrix completion Linear least squares
84	Approximation Algorithms for Submodular Optimization Satoru Iwata University of Tokyo Add to Reading List Source URL: www.iasi.cnr.it Language: English - Date: 2013-12-05 05:31:58
85	The Lasserre hierarchy in Approximation algorithms Lecture Notes for the MAPSP 2013 Tutorial Preliminary version∗ Thomas Rothvoß June 24, 2013 Add to Reading List Source URL: math.mit.edu Language: English - Date: 2014-01-08 17:30:05
86	Better Approximation Algorithms for Technology Diffusion Jochen K¨ onemann1 , Sina Sadeghian1 , and Laura Sanit`a1 University of Waterloo, Faculty of Mathematics, Department of Combinatorics & Optimization, Waterloo, ON Add to Reading List Source URL: www.math.uwaterloo.ca Language: English
87	Statistical Algorithms and a Lower Bound for Detecting Planted Cliques Vitaly Feldman Almaden Research Center IBM San Jose, CA 95120 Add to Reading List Source URL: www.levreyzin.com Language: English - Date: 2013-03-20 23:48:10 NP-complete problems Clique problem Approximation algorithm Probability distributions Dominating set
88	Blind, Greedy, and Random: Algorithms for Matching and Clustering using only Ordinal Information Elliot Anshelevich Shreyas Sekar Add to Reading List Source URL: www.cs.rpi.edu Language: English - Date: 2015-12-01 10:37:13 Matching Combinatorics NP-complete problems Combinatorial optimization Spanning tree Stable marriage problem Approximation algorithm 3-dimensional matching Minimum spanning tree
89	Faster Approximation Algorithms for Scheduling with Fixed Jobs Klaus Jansen1 1 Lars Prädel1 Add to Reading List Source URL: theory.epfl.ch Language: English - Date: 2012-09-06 12:29:05
90	Improved Approximation Algorithms for Graph-TSP in k -Regular Bipartite Graphs Jeremy Karp Add to Reading List Source URL: www.andrew.cmu.edu Language: English - Date: 2015-06-15 09:50:33

UPDATE